Diclib.com
Dicionário ChatGPT

Pesquisa de dicionário Soluções personalizadas

Digite uma palavra ou frase em qualquer idioma 👆

Idioma:

Tradução e análise de palavras por inteligência artificial ChatGPT

Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:

como a palavra é usada
frequência de uso
é usado com mais frequência na fala oral ou escrita
opções de tradução de palavras
exemplos de uso (várias frases com tradução)
etimologia

O que (quem) é symmetric problem - definição

COMPLEXITY CLASS OF PROBLEMS LOG-SPACE REDUCIBLE TO USTCON

USTCON; Symmetric Logspace; Symmetric logspace; Symmetric log-space; Symmetric log space; Undirected reachability problem; Sym-L; Undirected reachability

Elementary symmetric polynomial

HOMOGENEOUS SYMMETRIC POLYNOMIAL IN WHICH EACH POSSIBLE MONOMIAL OCCURS EXACTLY ONCE WITH COEFFICIENT 1

Elementary symmetric function; Elementary symmetric polynomials; Fundamental theorem of symmetric polynomials; Fundamental Theorem of Symmetric Polynomials

In mathematics, specifically in commutative algebra, the elementary symmetric polynomials are one type of basic building block for symmetric polynomials, in the sense that any symmetric polynomial can be expressed as a polynomial in elementary symmetric polynomials. That is, any symmetric polynomial is given by an expression involving only additions and multiplication of constants and elementary symmetric polynomials.

https://en.wikipedia.org/wiki/Elementary_symmetric_polynomial

Symmetric-key algorithm

ALGORITHM

Symmetric Algorithms; Symmetric key; Symmetric encryption; Symmetric key cryptography; Symmetric cypher; Shared key; Symmetric cipher; Symmetric-key cipher; Symmetric key algorithms; Symmetric cryptography; Private-key cryptography; Symmetric key encryption; Symmetric key algorithm; Reciprocal cipher; Reciprocal encipherment; Private key cryptography; Symmetric-key encryption algorithm; Symmetric-key cryptography; Private-key; Symmetric algorithm; Private-key encryption; Symmetrical encryption

Symmetric-key algorithms are algorithms for cryptography that use the same cryptographic keys for both the encryption of plaintext and the decryption of ciphertext. The keys may be identical, or there may be a simple transformation to go between the two keys.

https://en.wikipedia.org/wiki/Symmetric-key_algorithm

symmetric key cryptography

ALGORITHM

Symmetric Algorithms; Symmetric key; Symmetric encryption; Symmetric key cryptography; Symmetric cypher; Shared key; Symmetric cipher; Symmetric-key cipher; Symmetric key algorithms; Symmetric cryptography; Private-key cryptography; Symmetric key encryption; Symmetric key algorithm; Reciprocal cipher; Reciprocal encipherment; Private key cryptography; Symmetric-key encryption algorithm; Symmetric-key cryptography; Private-key; Symmetric algorithm; Private-key encryption; Symmetrical encryption

<cryptography> A cryptography system in which both parties have the same encryption key, as in {secret key cryptography}. Opposite: public-key cryptography. (1998-06-09)

Wikipédia

SL (complexity)

In computational complexity theory, SL (Symmetric Logspace or Sym-L) is the complexity class of problems log-space reducible to USTCON (undirected s-t connectivity), which is the problem of determining whether there exists a path between two vertices in an undirected graph, otherwise described as the problem of determining whether two vertices are in the same connected component. This problem is also called the undirected reachability problem. It does not matter whether many-one reducibility or Turing reducibility is used. Although originally described in terms of symmetric Turing machines, that equivalent formulation is very complex, and the reducibility definition is what is used in practice.

USTCON is a special case of STCON (directed reachability), the problem of determining whether a directed path between two vertices in a directed graph exists, which is complete for NL. Because USTCON is SL-complete, most advances that impact USTCON have also impacted SL. Thus they are connected, and discussed together.

In October 2004 Omer Reingold showed that SL = L.

https://en.wikipedia.org/wiki/SL (complexity)